Random field

Results: 650



#Item
91Approximate Polynomial Decomposition∗ Robert M. Corless†‡  Mark W. Giesbrecht‡

Approximate Polynomial Decomposition∗ Robert M. Corless†‡ Mark W. Giesbrecht‡

Add to Reading List

Source URL: www.apmaths.uwo.ca

Language: English - Date: 2000-03-21 10:51:19
92Supervised Learning of Edges and Object Boundaries Piotr Doll´ar Zhuowen Tu  Serge Belongie

Supervised Learning of Edges and Object Boundaries Piotr Doll´ar Zhuowen Tu Serge Belongie

Add to Reading List

Source URL: pages.ucsd.edu

Language: English - Date: 2006-04-02 13:05:32
93Combining Discriminative Features to Infer Complex Trajectories  David A. Ross  Simon Osindero

Combining Discriminative Features to Infer Complex Trajectories David A. Ross Simon Osindero

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2006-06-07 15:00:45
94Programming with “Big Code”: Lessons, Techniques and Applications Pavol Bielik1 , Veselin Raychev1 , and Martin Vechev1 1  Department of Computer Science, ETH Zurich, Switzerland

Programming with “Big Code”: Lessons, Techniques and Applications Pavol Bielik1 , Veselin Raychev1 , and Martin Vechev1 1 Department of Computer Science, ETH Zurich, Switzerland

Add to Reading List

Source URL: www.srl.inf.ethz.ch

Language: English - Date: 2015-04-14 05:42:43
95Message passing with l1 penalized KL minimization  Yuan Qi  Departments of Computer Science and Statistics, Purdue University, West Lafayette, INUSA Yandong Guo

Message passing with l1 penalized KL minimization Yuan Qi Departments of Computer Science and Statistics, Purdue University, West Lafayette, INUSA Yandong Guo

Add to Reading List

Source URL: jmlr.org

Language: English - Date: 2013-08-14 01:36:44
96THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE Alexander Barvinok and J.A. Hartigan November 2011 Abstract. We consider the set of all graphs on n labeled vertices with prescribed

THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE Alexander Barvinok and J.A. Hartigan November 2011 Abstract. We consider the set of all graphs on n labeled vertices with prescribed

Add to Reading List

Source URL: www.math.lsa.umich.edu

Language: English - Date: 2011-11-22 11:29:45
97GENERALIZED GAUSSIAN MARKOV RANDOM FIELD IMAGE RESTORATION USING VARIATIONAL DISTRIBUTION APPROXIMATION S. Derin Babacan† , Rafael Molina‡ , Aggelos K. Katsaggelos† †  ‡

GENERALIZED GAUSSIAN MARKOV RANDOM FIELD IMAGE RESTORATION USING VARIATIONAL DISTRIBUTION APPROXIMATION S. Derin Babacan† , Rafael Molina‡ , Aggelos K. Katsaggelos† † ‡

Add to Reading List

Source URL: decsai.ugr.es

Language: English - Date: 2007-12-28 04:09:02
98Parallel Gibbs Sampling: From Colored Fields to Thin Junction Trees  Joseph E. Gonzalez Carnegie Mellon University

Parallel Gibbs Sampling: From Colored Fields to Thin Junction Trees Joseph E. Gonzalez Carnegie Mellon University

Add to Reading List

Source URL: select.cs.cmu.edu

Language: English
99Evidence-Specific Structures for Rich Tractable CRFs  Carlos Guestrin Carnegie Mellon University

Evidence-Specific Structures for Rich Tractable CRFs Carlos Guestrin Carnegie Mellon University

Add to Reading List

Source URL: select.cs.cmu.edu

Language: English - Date: 2010-12-02 01:46:24
100GRAPHICAL POTENTIAL GAMES YAKOV BABICHENKO AND OMER TAMUZ Abstract. We study the class of potential games that are also graphical games with respect to a given graph G of connections between the players. We show that, up

GRAPHICAL POTENTIAL GAMES YAKOV BABICHENKO AND OMER TAMUZ Abstract. We study the class of potential games that are also graphical games with respect to a given graph G of connections between the players. We show that, up

Add to Reading List

Source URL: people.hss.caltech.edu

Language: English - Date: 2016-04-11 02:02:34